package mybag2;

import java.util.Iterator;
import java.util.LinkedList;

public class NumList {
	// 第2题:已知数组存放一批QQ号码，QQ号码最长为11位，最短为5位String[] strs =
	// {"12345","67891","12347809933",
	// "98765432102","67891","12347809933"}。
	// 将该数组里面的所有qq号都存放在LinkedList中，将list中重复元素删除，将list中所有元素分别用迭代器和增强for循环打印出来。
	public static void main(String[] args) {
		String[] strs = { "12345", "67891", "12347809933", "98765432102", "67891", "12347809933" };
		LinkedList<String> list = new LinkedList<String>();
		for (int i = 0; i < strs.length; i++) {
			list.add(strs[i]);
		}
		list.remove(1);
		list.remove(1);
		// 增强型for循环。
		for (String string : list) {
			System.out.println(string);
		}
		// 迭代循环
		System.out.println("-----------------------------------------------");
		Iterator<String> it = list.iterator();
		while (it.hasNext()) {
			System.out.println(it.next());
		}
	}
}
